Published in: LIPIcs, Volume 146, 33rd International Symposium on Distributed Computing (DISC 2019)
Shiri Chechik and Doron Mukhtar. Reachability and Shortest Paths in the Broadcast CONGEST Model. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 11:1-11:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chechik_et_al:LIPIcs.DISC.2019.11, author = {Chechik, Shiri and Mukhtar, Doron}, title = {{Reachability and Shortest Paths in the Broadcast CONGEST Model}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {11:1--11:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.11}, URN = {urn:nbn:de:0030-drops-113183}, doi = {10.4230/LIPIcs.DISC.2019.11}, annote = {Keywords: Distributed algorithms, Broadcast CONGEST, distance estimation, small diameter} }
Feedback for Dagstuhl Publishing